Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
نویسندگان
چکیده
منابع مشابه
Ordered Subrings of the Reals in Which Output Sets Are Recursively Enumerable
In On a theory of computation and complexity over the real numbers ... , Bull. Amer. Math. Soc. 21 (1989), 1-46, Blum, Shub, and Smale investigated computability over the reals and over ordered rings in general. They showed that over the reals, output sets of machines are recursively enumerable (i.e., halting sets of machines). It is asked in the aforementioned paper which ordered rings have th...
متن کاملSelection by Recursively Enumerable Sets
For given sets A, B, and Z of natural numbers where the members of Z are z0, z1, . . . in ascending order, one says that A is selected from B by Z if A(i) = B(zi) for all i. Furthermore, say that A is selected from B if A is selected from B by some recursively enumerable set, and that A is selected from B in n steps iff there are sets E0, E1, . . . , En such that E0 = A, En = B, and Ei is selec...
متن کاملRecursively Enumerable Sets and Degrees
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and simple sets. 2. Dominating functions and quotient lattices. 3. Maximal sets and high degrees. 4. Low degrees, atomless sets, and invariant degree classes. 5. Incompleteness and completeness for noninvariant properties. Chapter II. The structure, automorphisms, and elementa...
متن کاملOn the Lattice of Recursively Enumerable Sets
This paper presents some new theorems concerning recursively enumerable (r.e.) sets. The aim of the paper is to advance the search for a decision procedure for the elementary theory of r.e. sets. More precisely, an effective method is sought for deciding whether or not an arbitrary sentence formulated in the lower predicate calculus with sole relative symbol £ is true of the r.e. sets. The main...
متن کاملTwo Notes on Recursively Enumerable Sets
Introduction. These notes are based on E. L. Post's paper Recursively enumerable sets of positive integers and their decision problems1 to which we shall refer as RES. The reader is assumed to be familiar with §§1-5 and 9 of this paper. In the first note we shall discuss some algebraic properties of simple and hypersimple sets. In the second note we shall prove the existence of a recursively en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1991
ISSN: 0002-9939
DOI: 10.2307/2048754